Logarithmic Barrier Function Method for Convex Quadratic Programming Problem
نویسندگان
چکیده
منابع مشابه
A logarithmic barrier cutting plane method for convex programming*
Users may download and print one copy of any publication from the public portal for the purpose of private study or research You may not further distribute the material or use it for any profit-making activity or commercial gain You may freely distribute the URL identifying the publication in the public portal Take down policy If you believe that this document breaches copyright, please contact...
متن کاملWhy the logarithmic barrier function in convex and linear programming?
We provide a simple interpretation of the use of the logarithmic barrier function in convex and linear programming. c © 2000 Elsevier Science B.V. All rights reserved. MSC: 90C05; 90C25
متن کاملOn the classical logarithmic barrier function method for a class of smooth convex programming problems
In this paper we propose a large{step analytic center method for smooth convex programming. The method is a natural implementation of the classical method of centers. It is assumed that the objective and constraint functions ful l the socalled Relative Lipschitz Condition, with Lipschitz constant M > 0. A great advantage of the method, above the existing path{following methods, is that the step...
متن کاملOn the Convergence of a Modiied Barrier Function Method for Convex Quadratic and Linear Programming
We analyze convergence properties of the Modiied Barrier Function Method (MBFM), which operates like the usual Augmented Lagrangian method, except that it uses a shifted logarithmic barrier function in place of the usual quadratic penalty function. The MBFM avoids some of the drawbacks of classical barrier methods. The convergence of the MBFM had previously been established under strict regular...
متن کاملA Barrier Function Method for the Nonconvex Quadratic Programming Problem with Box Constraints
Abstract. In this paper a barrier function method is proposed for approximating a solution of the nonconvex quadratic programming problem with box constraints. The method attempts to produce a solution of good quality by following a path as the barrier parameter decreases from a sufficiently large positive number. For a given value of the barrier parameter, the method searches for a minimum poi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Modern Applied Science
سال: 2008
ISSN: 1913-1852,1913-1844
DOI: 10.5539/mas.v2n4p144